Nested set complexes for posets and the Bier construction

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nested Set Complexes for Posets and the Bier Construction

We generalize the concept of combinatorial nested set complexes to posets and exhibit the topological relationship between the arising nested set complexes and the order complex of the underlying poset. In particular, a sufficient condition is given so that this relationship is actually a subdivision. We use the results to generalize the proof method of Čukić and Delucchi, so far restricted to ...

متن کامل

Bier Spheres and Posets

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n− 2)-spheres on 2n vertices as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his construction as giving the poset of all the intervals in a boolean algebra that “cut across an ideal.” Thus we arrive at a substantial generalization of Bi...

متن کامل

Complexes of Trees and Nested Set Complexes

We exhibit an identity of abstract simplicial complexes between the wellstudied complex of trees Tn and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be obtained from the complex of trees by a sequence of stellar subdivisions. We provide an explicit cohomology basis for the complex of trees that emerges naturally...

متن کامل

On the Topology of Nested Set Complexes

Nested set complexes appear as the combinatorial core of De ConciniProcesi arrangement models. We show that nested set complexes are homotopy equivalent to the order complexes of the underlying meet-semilattices without their minimal elements. For atomic semilattices, we consider the realization of nested set complexes by simplicial fans proposed in [FY], and we strengthen our previous result s...

متن کامل

Convex polytopes from nested posets

Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs of G, we consider the notion of associativity and tubes on posets. This leads to a new family of simple convex polytopes obtained by iterated truncations. These generalize graph associahedra and nestohedra, even encompassing notions of nestings on CW-complexes. However, these poset associahedra ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2008

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-08-09503-8